HR image from multiframes by Delaunay triangulation: a synopsis
نویسندگان
چکیده
An algorithm based on spatial tessellation and approximation of each triangle patch in the Delaunay triangulation (with smoothness constraints) by a bivariate polynomial is advanced to construct a high resolution (HR) high quality image from a set of low resolution (LR) frames. This algorithm, followed by post filtering, is suitable for real-time image sequence processing because of the fast expected (average) time construction of Delaunay triangulation and the local update feature.
منابع مشابه
A Quick Image Registration Algorithm Based on Delaunay Triangulation
The traditional image matching algorithms adopt more complex strategies when dealing with mismatch caused by a lot of noise. In this paper, a simple, intuitive and effective noise processing algorithm is proposed based on Delaunay triangulation in computational geometry. The algorithm extracts feature points using SIFT method, respectively establishes Delaunay triangulation in multi-spectral an...
متن کاملApply ing Two-d imens iona l De launay Triangulat ion to Stereo Data Interpolat ion
A b s t r a c t . Interpolation of 3D segments obtained through a trinocular stereo process is achieved by using a 2D Delannay triangulation on the image plane of one of the vision system cameras. The resulting two-dimensional triangulation is backprojected into the 3D space, generating a surface description in terms of triangular faces. The use of a constrained Delaunay triangulation in the im...
متن کاملProgressive Previewing of Ray-Traced Images Using Image-Plane Discontinuity Meshing
This paper presents a new method for progressively previewing a raytraced image while it is being computed. Our method constructs and incrementally updates a constrained Delaunay triangulation of the image plane. The points in the triangulation correspond to all of the image samples that have been computed by the ray tracer, and the constraint edges correspond to various important discontinuity...
متن کاملText String Extraction in Delaunay Triangulation
This paper establishes a Delaunay triangulation model for detecting text strings in an image. In this method, text regions are represented based on Delaunay triangles that can be extracted easily. A searching mechanism based on the left and right arms of a discrete symmetric axis is developed to locate text in an image. The discrete symmetric axis consists of a group of off-curve-edge adjacent ...
متن کاملAdaptive Delaunay Triangulation for Attractor Image Coding
The principle of attractor image coding presented in this paper is based on the theory of IFS (Iterated Function Systems). The algorithm exploits piece-wise similarities between blocks of diierent sizes. To improve the algorithms based on regular and square blocks, we propose an adaptive Delaunay triangulation of the image support. The originality of the method is to map the triangles on specii...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002